An End-Around Approach for Efficient Join Query Processing
نویسندگان
چکیده
منابع مشابه
An End-Around Approach for Efficient Join Query Processing
This paper introduced a method for producing immediate and result in multi-join query, in homogeneous and heterogeneous environment. In recent years Adaptive or Non Blocking join algorithms have attracted a lot of attention in streaming applications, where data is provided from autonomous data sources in heterogeneous network environments. This algorithms are better as compared to traditional a...
متن کاملRelational Nested Optional Join for Efficient Semantic Web Query Processing
Increasing amount of RDF data on the Web drives the need for its efficient and effective management. In this light, numerous researchers have proposed to use RDBMSs to store and query RDF annotations using the SQL and SPARQL query languages. The first few attempts at SPARQL-to-SQL translation revealed non-trivial challenges related to correctness and efficiency of such translation in the presen...
متن کاملEfficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given ...
متن کاملEfficient Join-Index-Based Join Processing: A Clustering Approach
A Join Index is a data structure used for processing join queries in databases. Join indices use pre-computation techniques to speed up online query processing and are useful for data-sets which are updated infrequently. The cost of join computation using a join-index with limited buuer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given the ...
متن کاملQuery Processing for Knowledge Bases Using Join
This paper addresses the problem of physical query processing for large object-oriented, temporal knowledge bases. The major tasks being investigated are how to generate the space of all possible execution plans for a given knowledge base query and how to traverse this space in order to choose an eecient execution plan. The results of this work include: (a) the formulation of a set of access le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16894-6943